Test Words, Generic Elements and Almost Primitivity

نویسندگان

  • B. Fine
  • G. Rosenberger
  • D. Spellman
  • M. Stille
  • M. STILLE
چکیده

A test element in a group G is an element g with the property that if f(g) = g for an endomorphism f of G to G then f must be an automorphism. A test element in a free group is called a test word. Nielsen gave the first example of a test word by showing that in the free group on x, y the commutator [x, y] satisfies this property. T. Turner recently characterized test words as those elements of a free group contained in no proper retract. Since free factors are retracts, test words are therefore very strong forms of non-primitive elements. In this paper we give some new examples of test words and examine the relationship between test elements and several other concepts, in particular generic elements and almost-primitive elements (APE’s). In particular we show that an almost primitive element which lies in a certain type of verbal subgroup must be a test word. Further using a theorem of Rosenberger on equations in free products we prove a result on APE’s, generic elements and test words in certain free products of free groups. Finally we examine test elements in non-free groups and introduce the concept of the test rank of a group.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Word insertions and primitivity ∗

In this paper we consider relations between the operation of word insertion and primitivity. A necessary and sufficient condition under which the insertion u ← u of the word u into itself has maximum cardinality is obtained. The notion of insertion sequence is introduced and sufficient conditions under which an insertion sequence is a special type of language (regular, context-free, biprefix co...

متن کامل

On Operations Preserving Primitivity of Partial Words with One Hole

The notion of a primitive word, one that is not a power of another word, is useful in many areas including coding theory, combinatorics on words, formal language theory, and text algorithms. The proportion of such words turns out to be very high. We investigate operations that preserve the primitivity of partial words with one hole, or words that have an undefined position. As a result, all pri...

متن کامل

Testing primitivity on partial words

Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language theory, coding theory, and combinatorics on words. Testing whether or not a word is primitive can be done in linear time in the length of the word. Indeed, a word is primitive if and only if it is not an inside factor...

متن کامل

Some operations preserving primitivity of words

We investigate some operations where essentially, from a given word w, the word ww′ is constructed where w′ is a modified copy of w or a modified mirror image of w. We study whether ww′ is a primitive word provided that w is primitive. For instance, we determine all cases with an edit distance of w and w′ at most 2 such that the primitivity of w implies the primitivity of ww′. The operations ar...

متن کامل

Loughborough University Institutional Repository

In the present paper, we introduce an alternative notion of the primitivity of words, that – unlike the standard understanding of this term – is not based on the power (and, hence, the concatenation) of words, but on morphisms. For any alphabet Σ, we call a word w ∈ Σ∗ morphically imprimitive provided that there are a shorter word v and morphisms h, h′ : Σ∗ → Σ∗ satisfying h(v) = w and h′(w) = ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999